An operational planning model for the dynamic vehicle allocation problem with uncertain demands

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Operational Planning Model for the Dynamic Vehicle Allocation Problem with Uncertain Demands?

The dynamic vehicle allocation problem arises when a motor carrier must simultaneously and in real time coordinate the dispatching of vehicles from one region to the next all over the country. The decision to send a vehicle loaded or empty from one region to the next, arriving in the destination region at some point in the future, must anticipate the downstream impacts of the decision. The cons...

متن کامل

Dynamic Ship Assignment Problem with Uncertain Demands

Product tanker shipping companies in the spot market face severe volatility in demand and in price. We explore shipping companies' two problems: evaluating supply and demand of the market and assigning cargoes in order to maximize profitability. By approximating the market as a queueing system, we obtain utilization ratios, which effectively model supply and demand of the market. This approach ...

متن کامل

The α-cost minimization model for capacitated facility location-allocation problem with uncertain demands

Facility location-allocation (FLA) problem, which has been proved to be a valuable method in siting service facility, is widely used in real life, such as emergency service systems, telecommunication networks, public services, etc. However, in real-world situations, the decision maker often lack the information about the customers’ demands, which leads to the FLA problem in uncertain environmen...

متن کامل

An algorithm for the vehicle routing problem with stochastic demands

Motivated by the fixed routes problem, where the objective is to design a set of routes to be operated unchanged over a period of time, we study the vehicle routing problem with stochastic demands. An algorithm is developed based on a stochastic programming model with recourse. Computational experiments show that the algorithm compares favorably to existing algorithms. This research was support...

متن کامل

Emergency Service Vehicle Location Problem with Batch Arrival of Demands

In this paper an emergency service vehicle (ESV) location problem has been considered in which it is assumed that each emergency call may require more than one ESV. In ESV location problem two factors should be known; the location of stations and the number of ESVs at each station. Hence, a nonlinear mixed integer programming model is presented in order to maximize the total response rate to th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transportation Research Part B: Methodological

سال: 1987

ISSN: 0191-2615

DOI: 10.1016/0191-2615(87)90005-1